/**
 * #      1505
 * 名称   最多 K 次交换相邻数位后得到的最小整数
 * 链接   https://leetcode-cn.com/problems/minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits
 * 题解   [64](https://leetcode-cn.com/problems/minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits/solution)
 * 通过率 35.1%
 * 难道   困难
 */

